A Compact Numerical Implementation for Solving Stokes Equations Using Matrix-vector Operations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Compact Numerical Implementation for Solving Stokes Equations Using Matrix-vector Operations

In this work, a numerical scheme is implemented to solve Stokes equations based on cell-centered finite difference over staggered grid. In this scheme, all the difference operations have been vectorized thereby eliminating loops. This is particularly important when using programming languages that require interpretations, e.g., MATLAB and Python. Using this scheme, the execution time becomes si...

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

a numerical algorithm for solving a class of matrix equations

in this paper, we present a numerical algorithm for solving matrix equations $(a otimes b)x = f$  by extending the well-known gaussian elimination for $ax = b$. the proposed algorithm has a high computational efficiency. two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

Using operational matrix for numerical solution of fractional differential equations

In this article, we have discussed a new application of modification of hat functions on nonlinear multi-order fractional differential equations. The operational matrix of fractional integration is derived and used to transform the main equation to a system of algebraic equations. The method provides the solution in the form of a rapidly convergent series. Furthermore, error analysis of the pro...

متن کامل

‎A matrix LSQR algorithm for solving constrained linear operator equations

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2015

ISSN: 1877-0509

DOI: 10.1016/j.procs.2015.05.297